منابع مشابه
Maximum-Bandwidth Node-Disjoint Paths
This paper presents a new method for finding the node-disjoint paths with maximum combined bandwidth in communication networks. This problem is an NP-complete problem which can be optimally solved in exponential time using integer linear programming (ILP). The presented method uses a maximum-cost variant of Dijkstra algorithm and a virtual-node representation to obtain the maximum-bandwidth nod...
متن کاملMaximum Flows on Disjoint Paths
We consider the question: What is the maximum flow achievable in a network if the flow must be decomposable into a collection of edgedisjoint paths? Equivalently, we wish to find a maximum weighted packing of disjoint paths, where the weight of a path is the minimum capacity of an edge on the path. Our main result is an Ω(log n) lower bound on the approximability of the problem. We also show th...
متن کاملLoad Balancing Using Multiple Node Disjoint Paths
This paper discusses the multiple node disjoint paths protocol (MNDP) for mobile ad hoc networks. A mobile ad hoc network is a collection of mobile nodes that cooperate without networking infrastructure so as to form a temporary network that meets some immediate needs. The MNDP protocol detects multiple paths and distributes transmitted packets over these paths. Such distribution reduces conges...
متن کاملOn Approximating Node-Disjoint Paths in Grids
In the Node-Disjoint Paths (NDP) problem, the input is an undirected n-vertex graph G, and a collection {(s1, t1), . . . , (sk, tk)} of pairs of vertices called demand pairs. The goal is to route the largest possible number of the demand pairs (si, ti), by selecting a path connecting each such pair, so that the resulting paths are node-disjoint. NDP is one of the most basic and extensively stud...
متن کاملShortest node-disjoint paths on random graphs
A localized method to distribute paths on random graphs is devised, aimed at finding the shortest paths between given source/destination pairs while avoiding path overlaps at nodes. We propose a method based on message-passing techniques to process global information and distribute paths optimally. Statistical properties such as scaling with system size and number of paths, average path-length ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Advanced Computer Science and Applications
سال: 2012
ISSN: 2158-107X,2156-5570
DOI: 10.14569/ijacsa.2012.030309